package com.potato.study.leetcode.p0728;

import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;

/**
 * 
 * @author liuzhao11
 * 
 * 	728. Self Dividing Numbers
 *  
 *         A self-dividing number is a number that is divisible by every digit it contains.

For example, 128 is a self-dividing number because 128 % 1 == 0, 128 % 2 == 0, and 128 % 8 == 0.

Also, a self-dividing number is not allowed to contain the digit zero.

Given a lower and upper number bound, output a list of every possible self dividing number, including the bounds if possible.

Example 1:
Input:
left = 1, right = 22
Output: [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22]
Note:

The boundaries of each input argument are 1 <= left <= right <= 10000.
 *         
 *         思路：
 *
 *
 * 
 */
public class Solution {

    private static Set<Integer> selfDividingNumCache = new HashSet<>();

    public List<Integer> selfDividingNumbers(int left, int right) {
        List<Integer> result = new ArrayList<>();
        for (int i = left ; i <= right ; i++) {
            if (isSelfDividingNumbers(i)) {
                result.add(i);
            }
        }
        return result;
    }

    private boolean isSelfDividingNumbers(int num) {
        if (selfDividingNumCache.contains(num)) {
            return true;
        }
        // 分别获取每个位置的数字取%
        int tmp = num;
        while (tmp > 0) {
            int bitNum = tmp % 10;
            if (bitNum == 0) {
                return false;
            }
            tmp /= 10;
            if (num % bitNum != 0) {
                return false;
            }
        }
        selfDividingNumCache.add(num);
        return true;
    }
	

	
	public static void main(String[] args) {
		Solution solution = new Solution();
		int left = 1;
		int right = 2;
        List<Integer> s = solution.selfDividingNumbers(left, right);
        System.out.println(s);
    }
}
